Inscribed rectangles in a smooth Jordan curve attain at least one third of all aspect ratios
نویسندگان
چکیده
We prove that for every smooth Jordan curve $\gamma$, if $X$ is the set of all $r\in [0,1]$ so there an inscribed rectangle in $\gamma$ aspect ratio $\mathrm{tan}(r\cdot \pi/4)$, then Lebesgue measure at least $1/3$. To do this, we study sets disjoint homologically nontrivial projective planes smoothly embedded $\mathbb{R}\times \mathbb{R}P^3$. any such can be equipped with a natural total ordering. combine this ordering Kemperman's theorem $S^1$ to $1/3$ sharp lower bound on probability Möbius strip filling $(2,1)$-torus knot solid torus times interval will intersect its rotation by uniformly random angle.
منابع مشابه
Largest inscribed rectangles in convex polygons
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1− ) times the optimum with probability t in time O( 1 log n) for any constant t < 1. We further give a dete...
متن کاملOn Comparing the Writhe of a Smooth Curve to the Writhe of an Inscribed Polygon
We find bounds on the difference between the writhing numbers of a smooth curve and a polygonal curve inscribed within. The proof is based on an extension of Fuller’s difference of writhe formula to the case of polygonal curves. The results establish error bounds useful in the numerical computation of writhe.
متن کاملLargest Inscribed Rectangles in Convex Polygons ( Extended Abstract ) ∗
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a deterministic approximation algorithm that computes an inscribed rectangle of area at least 1− times the optimum in running time O( 1 log 1 log n). Furthermore, a randomized approximatio...
متن کامل“At least one” caching
We consider a variant of the caching problem, where each request is a set of pages of a fixed size, instead of a single page. In order to serve such a request, we require at least one of those pages to be present in the cache. Each page is assumed to have unit size and unit cost for getting loaded into the cache. We prove lower bounds on the competitive ratio for this problem in both the determ...
متن کاملDigital Jordan Curve Theorems
Efim Khalimsky’s digital Jordan curve theorem states that the complement of a Jordan curve in the digital plane equipped with the Khalimsky topology has exactly two connectivity components. We present a new, short proof of this theorem using induction on the Euclidean length of the curve. We also prove that the theorem holds with another topology on the digital plane but then only for a restric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics
سال: 2021
ISSN: ['1939-8980', '0003-486X']
DOI: https://doi.org/10.4007/annals.2021.194.2.3